Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
431	The EATCS Award 2013 Laudatio for Martin Dyer Martin Dyer has made enormous and multifaceted contributions to Theoretical Computer Add to Reading List Source URL: eatcs.org Language: English - Date: 2013-02-18 11:02:17 Computational complexity theory Operations research Analysis of algorithms Martin Dyer Polynomial-time algorithm for approximating the volume of convex bodies Algorithm Approximation algorithm Linear programming Time complexity Theoretical computer science Applied mathematics Mathematics
432	A Subexponential Algorithm for Abstract Optimization Problems Bernd G¨artner Add to Reading List Source URL: www.inf.ethz.ch Language: English - Date: 2003-08-08 05:46:59 Operations research Computational complexity theory Linear programming Convex optimization Analysis of algorithms LP-type problem XTR Ellipsoid method Randomized algorithm Theoretical computer science Applied mathematics Mathematics
433	Sempere, A[removed]Animatronics, Children and Computation. Educational Technology & Society, 8 (4), [removed]Animatronics, Children and Computation Add to Reading List Source URL: www.ifets.info Language: English - Date: 2008-02-12 08:31:19 Software Actor model Concurrent computing Computer Computation Software development methodology Object-oriented programming Programming language Complexity Programming paradigms Computing Science
434	Choosing Subsets with Maximum Weighted Average David Eppstein∗ Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-02-11 22:14:24 Analysis of algorithms Combinatorial optimization Operations research Linear programming Selection algorithm Computational geometry K-set Algorithm Time complexity Mathematics Theoretical computer science Applied mathematics
435	Finding a minimum Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2007-07-31 06:22:12 Network theory Shortest path problem SL Dynamic programming Routing algorithms Spanning tree Minimum spanning tree Floyd–Warshall algorithm Theoretical computer science Mathematics Computational complexity theory
436	THE COMPLEXITY OF SATISFIABILITY PROBLEMS Thomas J. Schaefer* Department of Mathematics Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2006-08-30 11:43:07 MAX-3SAT Combinatory logic Mathematics Theoretical computer science Computer programming
437	PDF Document Add to Reading List Source URL: mslab.csie.asia.edu.tw Language: English - Date: 2012-11-08 19:42:30 Operations research Combinatorial optimization NP-complete problems Dynamic programming Equations Knapsack problem Change-making problem Shortest path problem Floyd–Warshall algorithm Mathematics Theoretical computer science Computational complexity theory
438	PDF Document Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-04-27 14:40:49 Exploration of the Moon N1 ALGOL 68 Operator Halstead complexity measures Software engineering Spaceflight Programming language theory
439	PDF Document Add to Reading List Source URL: www.tompeters.com Language: English - Date: 2011-10-28 06:08:10 Social psychology Sociocultural evolution Management Science Four-square cipher Classical cipher Computer programming Complex systems theory Complexity theory and organizations
440	PDF Document Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2004-07-15 10:02:04 Bin packing problem Operations research Packing problem Parallel computing Distributed computing NP-complete problems Dynamic programming Minimum spanning tree Mathematics Theoretical computer science Computational complexity theory